LPI: Approximating Shortest Paths using Landmarks

Trajectory estimation algorithm for mobile nodes using encounter information and geographical information

In this paper, we propose a centralized algorithm to estimate trajectories of mobile nodes using a reasonable number of landmarks, ad hoc wireless communication facility and geographical information. The method identifies such trajectories that nodes move between two landmarks with the shortest time, which may be the shortest paths with high possibility, and uses their intermediate positions as...

Approximating Shortest Paths in Arrangements of Lines

Glow discharge in microfluidic chips for visible analog computing.

Here we present a novel visible analog computing approach for solving a wide class of shortest path problems. Using a microfluidic chip for computation, based on the lighting up of a glow discharge, the solution to maze search problems, the solution of a network shortest path and k-shortest paths problems and the practical application of finding the shortest paths between several landmarks from...

Atlas: Approximating Shortest Paths in Social Graphs

The search for shortest paths is an essential primitive for a variety of graph-based applications, particularly those on online social networks. For example, LinkedIn users perform queries to find the shortest path “social links” connecting them to a particular user to facilitate introductions. This type of graph query is challenging for moderately sized graphs, but becomes computationally intr...

Simplest Instructions: Finding Easy-to-Describe Routes for Navigation

Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However, numerous findings in cognitive science show that the ease of use and communication of route instructions depends on factors other than just the length of a route, such as the number and complexity of decision points. Building ...